Separable Partitions
نویسندگان
چکیده
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fixed p and d we determine the maximum possible number rp,d(n) of separable partitions into p parts of n points in real d-space up to a constant factor. Of particular interest are the values rp,d(n) = Θ(nd( p 2)) for every fixed p and d ≥ 3, and rp,2(n) = Θ(n6p−12) for every fixed p ≥ 3. We establish similar results for spaces of finite Vapnik-Chervonenkis dimension and study the corresponding problem for points on the moment curve as well.
منابع مشابه
Separable d-Permutations and Guillotine Partitions
We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula, and explicit formula. We find a connection between multidimensional permutations and guillotine partitions of a box. In particular, a bijection between separable d-dimensional permutations and guillotine partitions of a 2d−1-dimensional bo...
متن کاملA Classification of Separable Rosenthal Compacta and Its Applications
Contents 1. Introduction 2 2. Ramsey properties of perfect sets and of subtrees of the Cantor tree 8 2.1. Notations 8 2.2. Partitions of trees 9 2.3. Partitions of perfect sets 11 3. Increasing and decreasing antichains of a regular dyadic tree 11 4. Canonicalizing sequential compactness of trees of functions 14 4.1. Sequential compactness of trees of functions 14 4.2. Equivalence of families o...
متن کاملEpistemic Entanglement due to Non-generating Partitions of Classical Dynamical Systems
Quantum entanglement relies on the fact that pure quantum states are dispersive and often inseparable. Since pure classical states are dispersion-free they are always separable and cannot be entangled. However, entanglement is possible for epistemic, dispersive classical states. We show how such epistemic entanglement arises for epistemic states of classical dynamical systems based on phase spa...
متن کاملStable partitions in additively separable hedonic games
We present computational results concerning stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractually individually stable partition. This contrasts with previous results such as NP-hardness of computing individually stable or Nash stable partitions. Secondly, we prove that checking whether the core or the strict core exists...
متن کاملSphere-separable partitions of multi-parameter elements
We show the optimality of sphere-separable partitions for problems where n vectors in d-dimensional space are to be partitioned into p categories to minimize a cost function which is dependent in the sum of the vectors in each category; the sum of the squares of their Euclidean norms; and the number of elements in each category.We further show that the number of these partitions is polynomial i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 91 شماره
صفحات -
تاریخ انتشار 1999